Arithmetic Ternary Decision Diagrams Applications and Complexity
نویسنده
چکیده
In a binary decision diagram (BDD), a non-terminal node representing a function f = xf0_xf1 has two edges for f0 and f1. In the arithmetic ternary decision diagram (Arith TDD), each non-terminal node has three edges, where the third edge denotes f2 = f0 + f1, and + is an integer addition. The Arith TDD represents the extended weight function, an integer function showing the numbers of true minterms in the cubes. The Arith TDD is useful to detect functional decompositions, prime implicants and prime implicates. Experimental results compare the sizes of BDDs and various TDDs for benchmark functions.
منابع مشابه
Ternary arithmetic polynomial expansions based on new transforms
New classes of Linearly Independent Ternary Arithmetic (LITA) transforms being the bases of ternary arithmetic polynomial expansions are introduced here. Recursive equations defining the LITA transforms and the corresponding butterfly diagrams are shown. Various properties and relations between introduced classes of new transforms are discussed. Computational costs to calculate LITA transforms ...
متن کاملA Unifying Approach to Edge-valued and Arithmetic Transform Decision Diagrams
This paper shows that binary decision diagrams (BDDs) and their generalizations are not only representations of switching and integer-valued functions, but also Fourier-like series expansions of them. Furthermore, it shows that edge-valued binary decision diagrams (EVBDDs) are related to arithmetic transform decision diagrams (ACDDs), which are the integer counterparts of the functional decisio...
متن کاملApplications of Multi-Terminal Binary Decision Diagrams
Functions that map boolean vectors into the integers are important for the design and verification of arithmetic circuits. MTBDDs and BMDs have been proposed for representing this class of functions. We discuss the relationship between these methods and describe a generalization called hybrid decision diagrams which is often much more concise. The Walsh transform and Reed-Muller transform have ...
متن کاملRestructuring of Arithmetic Circuits with Biconditional Binary Decision Diagrams
Biconditional Binary Decision Diagrams (BBDDs) are a novel class of canonical binary decision diagrams where the branching condition, and its associated logic expansion, is biconditional on two variables. In this demonstration, we use an efficient BBDD manipulation package as front-end to a commercial synthesis tool to restructure arithmetic operations in critical components of telecommunicatio...
متن کاملMulti-level Logic Synthesis Based on Kronecker Decision Diagrams and Boolean Ternary Decision Diagrams for Incompletely Speci ed Functions
This paper introduces several new families of decision diagrams for multi output Boolean functions The in troduced by us families include several diagrams known from literature BDDs FDDs as subsets Due to this property our diagrams can provide a more compact representation of functions than either of the two decision diagrams Kronecker Decision Diagrams KDDs with negated edges are based on thre...
متن کامل